Difference Equations Approach for Multi-Server Queueing Models with Removable Servers

Dynamic server allocation for unstable queueing networks with flexible servers

This paper is concerned with the dynamic assignment of servers to tasks in queueing networks where demand may exceed the capacity for service. The objective is to maximize the system throughput. We use fluid limit analysis to show that several quantities of interest, namely the maximum possible throughput, the maximum throughput for a given arrival rate, the minimum arrival rate that will yield...

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

Single Server Queueing Models

This technical support center is vital to Macrohard’s business strategy, since it has a significant impact on customers’ experience with their products. To ensure that this experience is positive, technicians must provide accurate information and helpful support. From Macrohard’s perspective, this is a matter of ensuring that the technician has the right skill and training. But for customers to...

A multi - server queueing model with

In this paper we analyse a multi-server queueing model with locking. The model is motivated by a situation we encountered at a maintenance facility for trains. Maintenance is done at parallel tracks, where each track ooers space to two trains. Trains can enter and leave the tracks from one and the same side only. This gives rise to locking of the front train: in order to leave the maintenance t...

A multi-server queueing model with locking